Throughput-based fair bandwidth allocation in OBS networks
نویسندگان
چکیده
منابع مشابه
Utility based fair bandwidth allocation
For over a decade, the Nash Bargaining Solution (NBS) concept from cooperative game theory has been used in networks as a concept that allows sharing resources fairly. Due to its many appealing properties, it has recently been used for assigning bandwidth in a general topology network between applications that have linear utilities. In this paper, we use this concept for the bandwidth allocatio...
متن کاملOn Fair Bandwidth Allocation in Connection-less Networks
We introduce a transport-independent mechanism for network-wide fair bandwidth allocation in the Internet based on a natural hierarchy of authorities. With our proposed approach, routers identify a dynamic set of so-called fluxes derived form descriptors (ranks) disseminated in the network in a hierarchical fashion. The scheme assumes no particular implementation of the sessions contributing to...
متن کاملFair Allocation of Discrete Bandwidth Layers in Multicast Networks
We study fairness when receivers in a multicast network can not subscribe to fractional layers. This case arises when the source hierarchically encodes its signal and the hierarchical structure is predetermined. Unlike the case of the fractional layer allocation, which has been studied extensively in [29], bandwidth can be allocated in discrete chunks only. Fairness issues become vastly differe...
متن کاملLexicographic maximin optimisation for fair bandwidth allocation in computer networks
This paper addresses the problem of bandwidth allocation in multi-application computer network environments. Allocations are determined from the solution of a multiple objective optimisation problem under network constraints, where the lexicographic maximin criterion is applied to solve the problem and guarantees fairness and efficiency properties to the solution. An algorithm based on a series...
متن کاملFair and efficient dynamic bandwidth allocation for multi-application networks
The large diversity of applications and requirements posed to current network environments make the resource allocation problem difficult to work out. This paper proposes a dynamic algorithm based on weighted fair queueing (WFQ) to promote fairness (in the Rawlsian sense) and efficiency (in the Paretian sense) in the allocation of bandwidth for multi-application networks. Utility functions are ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ETRI Journal
سال: 2018
ISSN: 1225-6463
DOI: 10.4218/etrij.2017-0253